新型壳聚糖/纳米二氧化硅杂化材料的制备与性能

在纳米S iO2颗粒表面引入羟丙基氯活性基团,得到功能化S iO2颗粒,再将羟丙基氯化的S iO2颗粒交联固定在壳聚糖上,制备了一种新型的壳聚糖/纳米S iO2杂化材料(简称杂化材料);通过傅里叶变换红外光谱、透射电镜、扫描电镜方法对杂化材料进行表征,采用热重(TG)分析研究杂化材料的热性能;考察了杂化材料的沉降速率和对金属离子Ca2+和M g2+的吸附能力。电镜分析结果表明,杂化材料微粒为纳米尺度的无机S iO2加强化的微粒,S iO2颗粒分散在材料中,形成均匀的表面;TG分析结果表明,杂化材料的热性能有所提高;沉降实验测得壳聚糖和杂化材料作为吸附剂的沉降时间分别为130.3,68.5s,表明杂化材料的沉降速率比壳聚糖的沉降速率快了近一倍;杂化材料对金属离子Ca2+和M g2+的吸附量分别可达到0.289 3,1.445 6mm ol/g。     

一种单相串联混合电力有源滤波器的研究

文中对串联混合电力滤波器抑制谐波的原理进行了分析。为了检测单项系统的谐波电流,提出一种基于虚拟三相法和瞬时无功理论的谐波检测方法,并且对串联滤波逆变器的直流侧电压的控制进行了讨论。仿真结果证明了其有效性。     

USB数据传输中CRC校验码的并行算法实现

文章介绍了用于USB总线数据传输的CRC校验的原理和算法，并且采用并行电路实现USB2．0中的CRC产生和CRC校验，与传统的串行电路实现相比，并行电路实现方法虽然在芯片面积上大于串行电路实现，但由于降低了时钟频率，电路更容易综合实现，并且大大降低了功耗，有利于低功耗电路设计。     

基于进化算法的常减压装置模拟

提出了基于优选优生进化算法（Select—best and prepotency evolution algorithm，SPEA）的常减压装置模拟方法。以各塔的温度分布为目标，基于生产过程和分析数据，采用SPEA确定各塔板Murphree效率，从而精确描述各塔板平衡偏离程度。在实际应用中，获得具有良好精度的常减压装置模型。系统分析了SPEA算法的关键参数——优选领域大小与计算复杂性及寻优性能之间的关系，结果显示其取值为群体规模的10％最为合适。     

基于两层均匀媒质的GPEN SAR地下目标成像方法及其性能分析

地表穿透合成孔径雷达(Ground PENetration SAR,GPEN SAR)为了探测掩埋在地下的目标,通常工作在多层媒质的环境中。传统成像模型是建立在同一均匀媒质的假设上,不再适合于GPEN SAR的实际情况。本文首先建立了两层分区均匀媒质中的成像模型,然后利用后向投影(BP)算法定量分析了成像几何参数、土壤参数等对成像的影响,进而提出了一种修正的后向投影(MBP)算法。MBP算法不仅能够校正两层分区均匀媒质对成像定位的影响,还能估计目标的掩埋深度,提供目标三维位置坐标。仿真结果验证了MBP算法在不同信噪比环境下,对多目标的三维定位精度能满足实际的需要。     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.     

个性化公开密钥系统的设计

论文提出利用用户提供的个性化信息来随机产生关联大素数,保证了素数选取的随机化、个性化,提高了RSA算法的安全性。     

一种基于无理数加密算法的数字签名方案

为了提高现代网络信息传输的安全性,利用无理数小数点后数字的无穷性、无规律性、分布均匀性,提出一种全新的加密算法,并用它所产生的密钥流进行数字签名,实现身份验证不可抵赖、信息传输无篡改,确保信息传输的完整性、真实性,达到提高加密效率、相互认证的效果。     

人工免疫原理在网络入侵检测系统中的研究

文章分析了人工免疫系统的原理,简单建立了一种基于否定选择算法的网络入侵检测系统,引入了一种用于异常事件识别的r-字符块匹配规则,并对规则存在的漏洞进行了分析。     

分组空时块码系统中的排序最大信噪比检测算法

提出并比较了应用于分组空时块码（G—STBC）系统中两种不同信道模型的排序最大信噪比（MaxSNR）检测算法。该系统在发端对发射天线分组，每组进行独立的空时块码编码；在收端应用排序最大信噪比算法进行检测。由于空时块码提供了额外的时域约束，所以可以利用这个约束对信道模型进行变换，得到一个等效信道模型，然后再使用排序MaxSNR检测；当然也可以直接利用原有的信道模型，即非等效信道模型进行检测。仿真结果表明：当接收天线数不少于发射天线数的一半时，采用等效信道模型下的排序MaxSNR算法，系统的误码曲线就能保持陡降性；并且在收发天线数相同时，其性能总是优于非等效信道模型。